Dividing connected chores fairly
نویسندگان
چکیده
منابع مشابه
Dividing Connected Chores Fairly
In this paper we consider the fair division of chores (tasks that need to be performed by agents, with negative utility for them), and study the loss in social welfare due to fairness. Previous work has been done on this so-called price of fairness, concerning fair division of cakes and chores with non-connected pieces and of cakes with connected pieces. We provide tight or nearly tight bounds ...
متن کاملUsing auctions to allocate chores∗
In this paper we present an application of the auction mechanisms to the allocation of a chore (a bad) to one of the bidders belonging to a given set B. We also discuss an extension of such an application to the allocation of a set of chores among an initial set of bidders B. The paper aims at showing how the classic auction mechanism can be modified and adapted for the allocation of bads (chor...
متن کاملHow to Divide Things Fairly
We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score, of the items received by a player. Although SA...
متن کاملA heuristic approach for dividing graphs into bi-connected components with a size constraint
In this paper we propose a new problem of finding the maximal biconnected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. ...
متن کاملHow to mark fairly
A network router that marks packets to signal congestion should do so fairly. We propose a deenition of fairness, using ideas from eeective band-width theory and economics. Our deenition measures both the level of congestion at a router and the contribution of each ow to that congestion, taking into account the ow's burstiness. We then use large deviations to analyse marking algorithms such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.041